Orthogonal Matching Pursuit : Recursive Function Approximation with Applications to WaveletDecompositionY
نویسندگان
چکیده
In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. aane (wavelet) frames. We propose a modiication to the Matching Pursuit algorithm of Mallat and Zhang (1992) that maintains full backward orthogonality of the residual (error) at every step and thereby leads to improved convergence. We refer to this modiied algorithm as Orthogonal Matching Pursuit (OMP). It is shown that all additional computation required for the OMP algorithm may be performed recursively.
منابع مشابه
Orthogonal Matching Pursuit: Recursive Function Approximat ion with Applications to Wavelet Decomposition
where fk is the current approximation, and Rk f the current residual (error). Using initial values of Ro f = f , fo = 0, and k = 1 , the M P algorithm is comprised of the following steps, In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries (I) Compute the inner-products {(Rkf, Zn)},. of elem...
متن کاملA fast orthogonal matching pursuit algorithm
The problem of optimal approximation of members of a vector space by a linear combination of members of a large overcomplete library of vectors is of importance in many areas including image and video coding, image analysis, control theory, and statistics. Finding the optimal solution in the general case is mathematically intractable. Matching pursuit, and its orthogonal version, provide greedy...
متن کاملAn Online Kernel Learning Algorithm based on Orthogonal Matching Pursuit
Matching pursuit algorithms learn a function that is weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target function in the least-squares sense. Experimental result shows that it is an effective method, but the drawbacks are that this algorithm is not appropriate to online learning or estimating the strongly nonlinear functions....
متن کاملThe Stability of Regularized Orthogonal Matching Pursuit Algorithm
This paper studies a fundamental problem that arises in sparse representation and compressed sensing community: can greedy algorithms give us a stable recovery from incomplete and contaminated observations ? Using the Regularized Orthogonal Matching Pursuit (ROMP) algorithm, a modified version of Orthogonal Matching Pursuit (OMP) [1], which was recently introduced by D.Needell and R.Vershynin [...
متن کاملCooperative Orthogonal Matching Pursuit strategies for sparse approximation by partitioning
Cooperative Orthogonal Matching Pursuit strategies are considered for approximating a signal partition, subjected to a global constraint on sparsity. The approach is designed to produce a high quality sparse approximation of the whole signal, using highly coherent redundant dictionaries. The cooperation takes place by ranking the partition units for their sequential stepwise approximation and i...
متن کامل